Random patterns generated by random permutations of natural numbers
نویسندگان
چکیده
We survey recent results on some one-and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time n, whose moves to the right or to the left are induced by the rise-and-descent sequence associated with a given random permutation. We determine exactly the probability of finding the trajectory of such a permutation-generated random walk at site X at time n, obtain the probability measure of different excursions and define the asymptotic distribution of the number of " U-turns " of the trajectories-permutation " peaks " and " through ". In the second part, we focus on some statistical properties of surfaces obtained by randomly placing natural numbers 1, 2, 3,. .. , L on sites of a 1d or 2d square lattices containing L sites. We calculate the distribution function of the number of local " peaks "-sites the number at which is larger than the numbers appearing at nearest-neighboring sites-and discuss some surprising collective behavior emerging in this model.
منابع مشابه
The Shape of Random Pattern-avoiding Permutations
We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We view the permutations as 0-1 matrices to describe the resulting asymptotics geometrically. We then apply our results to obtain a number of results on distribu...
متن کاملنقش اعداد تصادفی در شبیه سازی و بررسی تحلیلی الگوریتمهای تولید اعداد تصادفی و ارائه روش تلفیقی جدید
Abstract: Analyzing different issues of most systems, particularly their design, implementation, and development, requires some sort of techniques which are capable of studying their special conditions in stochastic states. Simulation is regarded as one of the most efficient methods for this purpose in the area of engineering, systems, and management. Studying and analyzing a system under spe...
متن کاملOn the sub-permutations of pattern avoiding permutations
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and probabilistic properties of sub-permutations and to investigate the relationships between ’local’ and ’global’ features using the concept of pattern avoidance. ...
متن کاملUnfair permutations
We study unfair permutations, which are generated by letting [Formula: see text] players draw numbers and assuming that player [Formula: see text] draws [Formula: see text] times from the unit interval and records her largest value. This model is natural in the context of partitions: the score of the [Formula: see text]th player corresponds to the multiplicity of the summand [Formula: see text]...
متن کاملConsensus Ranking with Signed Permutations
Signed permutations (also known as the hyperoctahedral group) are used in modeling genome rearrangements. The algorithmic problems they raise are computationally demanding when not NP-hard. This paper presents a tractable algorithm for learning consensus ranking between signed permutations under the inversion distance. This can be extended to estimate a natural class of exponential models over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006